On Trace Languages Generated by (Small) Spiking Neural P Systems
نویسندگان
چکیده
We extend to spiking neural P systems a notion investigated in the “standard” membrane systems: the language of the traces of a distinguished object. In our case, we distinguish a spike by “marking” it and we follow its path through the neurons of the system, thus obtaining a language. Several examples are discussed and some preliminary results about this way of associating a language with a spiking neural P system are given, together with a series of topics for further research. For instance, we show that each regular language is the morphic image of a trace language intersected with a very particular regular language, while each recursively enumerable language over the one-letter alphabet is the projection of a trace language. In all proofs we try to keep the size of used systems (number of neurons, of rules in each neuron, of spikes consumed or removed by rules) as small as possible.
منابع مشابه
On languages generated by asynchronous spiking neural P systems
In this paper, we investigate the languages generated by asynchronous spiking neural P systems. Characterizations of finite languages and recursively enumerable languages are obtained by asynchronous spiking neural P systems with extended rules. The relationships of the languages generated by asynchronous spiking neural P systems with regular and non-semilinear languages are also investigated. ...
متن کاملOn Trace Languages Generated by Spiking Neural P Systems
1 Computer Science Laboratory, Institute of Software Chinese Academy of Sciences 100080 Beijing, China [email protected] 2 Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain [email protected] 3 Department of Computer Science Louisiana Tech University, Ruston PO Box 10348, Louisiana, LA-71272 USA [email protected], bdp010@la...
متن کاملControl Languages Associated with Spiking Neural P Systems
We consider labeled spiking neural P systems, which are usual spiking neural P systems with a label associated with every rule; the labels are symbols of a given alphabet or can be λ (empty). The rules used in a transition should have either the empty label or the same label from the chosen alphabet. In this way, a string is associated with each halting computation, called the control word of t...
متن کاملExtended Spiking Neural P Systems Generating Strings and Vectors of Non-Negative Integers
We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy proofs of the computational completeness of extended spiking neural P systems and for the characterization of semilinear sets and regular languages by finite extended spiking neural P systems (defined by having only finite sets of rules assigned to the cells) with only a ...
متن کاملExtended Spiking Neural P Systems
We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy proofs of the computational completeness of extended spiking neural P systems and for the characterization of semilinear sets and regular languages by finite extended spiking neural P systems (defined by having only finite checking sets in the rules assigned to the cells)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 682 شماره
صفحات -
تاریخ انتشار 2006